The AOR iterative method for new preconditioned linear systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Analysis of Preconditioned AOR Iterative Method for Linear Systems

MHmatrices appear in many areas of science and engineering, for example, in the solution of the linear complementarity problem LCP in optimization theory and in the solution of large systems for real-time changes of data in fluid analysis in car industry. Classical stationary iterative methods used for the solution of linear systems have been shown to convergence for this class of matrices. In ...

متن کامل

On the modification of the preconditioned AOR iterative method for linear system

In this paper, we will present a modification of the preconditioned AOR-type method for solving the linear system. A theorem is given to show the convergence rate of modification of the preconditioned AOR methods that can be enlarged than the convergence AOR method.

متن کامل

A New Preconditioned AOR Iterative Method and Comparison Theorems for Linear Systems

In this paper, a new preconditioned AOR iterative method is proposed with the preconditioner I + Sα. Some comparison theorems are given when the coefficient matrix A of linear system is an irreducible L− matrix. Numerical example shows that our methods are superior to the basic AOR iterative method.

متن کامل

on the modification of the preconditioned aor iterative method for linear system

in this paper, we will present a modification of the preconditioned aor-type method for solving the linear system. a theorem is given to show the convergence rate of modification of the preconditioned aor methods that can be enlarged than the convergence aor method.

متن کامل

Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2001

ISSN: 0377-0427

DOI: 10.1016/s0377-0427(00)00447-7